Computational complexity of relating time points with intervals
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Relating Time Points with Intervals
Several algebras have been proposed for reasoning about qualitative constraints over the time line. One of these algebras is Vilain's point-interval algebra, which can relate time points with time intervals. Apart from being a stand-alone qualitative algebra, it is also used as a subalgebra in Meiri's approach to temporal reasoning, which combines reasoning about metric and qualitative temporal...
متن کاملComputational complexity of fixed points
A review of computational complexity results for approximating fixed points of Lipschitz functions is presented. Univariate and multivariate results are summarized for the second and infinity norm cases as well as the absolute, residual and relative error criteria. Contractive, nonexpansive, directionally nonexpansive, and expansive classes of functions are considered and optimal or nearly opti...
متن کاملThe Computational Complexity ofRelating Points
Vilain has suggested the point-interval algebra for reasoning about the relative positions of points and intervals on the real line. The satissability problem for the full point-interval algebra is known to be NP-complete but the computational complexity of its 4; 294; 967; 296 subclasses has not been investigated. We classify these subclasses with respect to whether their corresponding satissa...
متن کاملthe effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
Spanning Colored Points with Intervals
We study a variant of the problem of spanning colored objects where the goal is to span colored objects with two similar regions. We dedicate our attention in this paper to the case where objects are points lying on the real line and regions are intervals. Precisely, the goal is to compute two intervals together spanning all colors. As the main ingredient of our algorithm, we first introduce a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1999
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(99)00007-7